An Enhanced Particle Swarm Optimization for ITC2021 Sports Timetabling

نویسندگان

چکیده

Timetabling problem is among the most difficult operational tasks and an important step in raising industrial productivity, capability, capacity. Such are usually tackled using metaheuristics techniques that provide intelligent way of suggesting solutions or decision-making. Swarm intelligence including Particle Optimization (PSO) have proved to be effective examples. Different recent experiments showed PSO algorithm reliable for timetabling many applications such as educational personnel timetabling, machine scheduling, etc. However, having optimal solution extremely challenging but a sub-optimal heuristics guaranteed. This research paper seeks enhancement efficient task. aims at generating feasible timetable within reasonable time. enhanced version hybrid dynamic adaptive tested on round-robin tournament known ITC2021 which dedicated sports timetabling. The competition includes several soft hard constraints satisfied order build timetable. It consists three categories complexities, namely early, test, middle instances. Results proposed has obtained timetables almost all feasibility measured by minimizing violation zero. performance evaluated consumed computational time produce timetable, consistency, robustness. robust consistent producing diversity

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Particle Swarm Optimization with Transition Probability for Timetabling Problems

In this paper, we propose a new algorithm to solve university course timetabling problems using a Particle Swarm Optimization (PSO). PSOs are being increasingly applied to obtain near-optimal solutions to many numerical optimization problems. However, it is also being increasingly realized that PSOs do not solve constraint satisfaction problems as well as other meta-heuristics do. In this paper...

متن کامل

Solving effectively the school timetabling problem using particle swarm optimization

New results are listed below, derived from the algorithm presented at the corresponding paper, due to a minor significance bug correction and further experiments conducted after the publication date of the paper. The new results may differ from those mentioned at the text of the original paper. Nevertheless, the new results are, in the great majority, at least as good as the previous ones conce...

متن کامل

An approach to Improve Particle Swarm Optimization Algorithm Using CUDA

The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...

متن کامل

Particle swarm optimization An overview

Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. As researchers have learned about the technique, they have derived new versions, developed new applications, and published theoretical studies of the effects of the various parameters and aspects of the algorithm. This paper comprises a snapshot of particle swarming from the authors’ perspective, includ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.025077